Nuprl Lemma : count_pairs_wf 4,23

T:Type, L:T List, P:(TT). count(x < y in L | P(x,y))   
latex


Definitionsb, b, Prop, P  Q, Unit, xt(x), sum(f(x) | x < k), sum(f(x;y) | x < ny < m), x:AB(x), ij, ||as||, t  T, , P  Q, False, A, AB, P & Q, i  j < k, {i..j}, , l[i], x(s1,s2), i<j, p  q, if b t else f fi, x,yt(x;y), count(x < y in L | P(x;y))
Lemmasdouble sum wf, ifthenelse wf, band wf, lt int wf, select wf, int seg wf, le wf, length wf1, bool wf, non neg length, sum wf, non neg sum, eqtt to assert, iff transitivity, eqff to assert, assert of bnot, bnot wf, not wf, assert wf

origin